A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters
نویسندگان
چکیده
This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.
منابع مشابه
A Triple objective function with a chebychev dynamic point specification approach to optimise the surface mount placement machine
Optimisation can play a major role in improving the throughput of surface mount placement machines. Most previous work has reported on improving only the assembly cycle time. The movement of the feeder carrier and PCB table are not always factors which are minimised. In this paper we introduce a triple objective function with a Chebychev dynamic pick-and-place approach to optimise the sequentia...
متن کاملA triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine
Optimisation can play a major role in improving the throughput of surface mount placement machines. Most previous work has reported on improving only the assembly cycle time. The movement of the feeder carrier and PCB table are not always factors which are minimised. In this paper we introduce a triple objective function with a Chebychev dynamic pick-and-place approach to optimise the sequentia...
متن کاملA Robust credibility-based fuzzy programming for supply chain optimization in lean manufacturing environment
Lean manufacturing is a strategic concern for companies which conduct mass production and it has become even more significant for those producing in a project-oriented way by modularization. In this paper, a bi-objective optimization model is proposed to design and plan a supply chain up to the final assembly centre. The delivery time and the quality in the procurement and low fluctuation of t...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007